computational complexity theory - PDFSEARCH.IO - Document Search Engine

computational complexity theory
Results: 2049

#	Item
701	How to Put Through Your Agenda in Collective Binary Decisions? Noga Alon1 , Robert Bredereck2 , Jiehua Chen2 , Stefan Kratsch2 Rolf Niedermeier2 , and Gerhard J. Woeginger3 2 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-10-23 10:13:29 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Mathematical optimization Vertex cover Dominating set Time complexity FO Theoretical computer science Computational complexity theory Applied mathematics
702	Bicriteria data compression Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, and Rossano Venturini Dipartimento di Informatica, Universit`a di Pisa, Italy arXiv:1307.3872v1 [cs.IT] 15 Jul 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-07-15 21:15:01 Mathematics Computational complexity theory LZ77 and LZ78 Algebraic combinatorics Representation theory Lempel–Ziv–Markov chain algorithm Pi Symbol
703	Discrete Comput Geom: 701–722 DOIs00454z Minimum Manhattan Network is NP-Complete Francis Y.L. Chin · Zeyu Guo · He Sun Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2011-05-04 06:25:07 Microsoft Gadgets Computing Computational complexity theory Gadget Struct
704	Saving Private Randomness in One-Way Functions and Pseudorandom Generators Nenad Dedi´c∗ ‡ § Danny Harnik† § Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-12-10 11:39:44 Pseudorandomness Computational complexity theory Randomness Hashing Pseudorandom generator theorem Pseudorandom generator One-way function Hard-core predicate Cryptographic hash function Cryptography Theoretical computer science Applied mathematics
705	Journal of Artificial Intelligence Research446 Submitted 12/13; published 6/14 A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-06-16 17:55:22 Complexity classes NP-complete problems Analysis of algorithms Mathematical optimization Parameterized complexity NP-hard Kernelization NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
706	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
707	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Bin packing problem Approximation algorithm Polynomial-time approximation scheme Subset sum problem NP PP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
708	Motivation The collision-free string partition problems Complexity proofs Summary The complexity of string partitioning Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2012-12-29 15:22:02 Computational complexity theory Descriptive complexity SO Complexity FO Theoretical computer science Finite model theory Applied mathematics
709	Communication Complexity Advanced Algorithms – COMS31900 this is Alice Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Communication complexity Computational complexity theory Quantum complexity theory Quantum information science ISO 216 Function Mathematics Applied mathematics Communication
710	Scheduling Sport Tournaments using Constraint Logic Programming Andrea Schaerf Dipartimento di Informatica e Sistemistica Universit` a di Roma “La Sapienza” Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:14 Applied mathematics Mathematical optimization Combinatorial optimization Complexity classes Constraint logic programming Logic programming Constraint Matching Assignment problem Theoretical computer science Constraint programming Computational complexity theory

UPDATE